Cyclic Sieving of Noncrossing Partitions for Complex Reflection Groups
نویسندگان
چکیده
منابع مشابه
Cyclic Sieving of Noncrossing Partitions for Complex Reflection Groups
We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.
متن کاملCyclic Sieving for Generalised Non–Crossing Partitions Associated to Complex Reflection Groups of Exceptional Type
We present the proof of the cyclic sieving conjectures for generalised non-crossing partitions associated to well-generated complex reflection groups due to Armstrong, respectively to Bessis and Reiner, for the 26 exceptional well-generated complex reflection groups. The computational details are provided in the manuscript “Cyclic sieving for generalised non-crossing partitions associated to co...
متن کاملBijections between noncrossing and nonnesting partitions for classical reflection groups
We present type preserving bijections between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis and Reiner. The bijections for the abstract Coxeter types B, C and D are new in the literature. To find them we define, for every type, sets of statistics that are in bijection with noncrossing and nonnesting partitions, and this correspon...
متن کاملOn Noncrossing and Nonnesting Partitions for Classical Reflection Groups
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonnesting partitions. We show that a similar statement is true for the analogues of such partitions for root systems B and C, defined recently by Reiner in the noncrossing case and Postnikov in the nonnesting case. Some of...
متن کاملEL-Shellability of Generalized Noncrossing Partitions Associated to Well-Generated Complex Reflection Groups
In this article we prove that the poset of m-divisible noncrossing partitions is EL-shellable for every wellgenerated complex reflection group. This was an open problem for type G(d, d, n) and for the exceptional types, for which a proof is given case-by-case. Résumé. Dans cet article nous prouvons que l’ensemble ordonné des partitions non-croisées m-divisibles est ELépluchable (“EL-shellable”)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2011
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-011-0090-9